Toward Incremental Parallelization Using Navigational Programming

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Navigational Programming

OF THE DISSERTATION Navigational Programming

متن کامل

Distributed Parallel Computing using Navigational Programming: Orchestrating Computations Around Data

Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to programming on distributed memory systems. MP is difficult to use, while DSM is not scalable. Performance scalability and ease of programming can be achieved at the same time by using “shared variable programming” and following the principle of “computation locus following data,” which is embodied in ...

متن کامل

Mobile Pipelines: Parallelizing Left-Looking Algorithms Using Navigational Programming

Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally, the parallel algorithm should preserve the computational structure of the original sequential algorithm, display a high degree of parallelism, have low communication overhead, and be scalable. The difficulty of accomplishing this ...

متن کامل

Inductive Functional Programming Using Incremental Program Transformation

The paper presents a system, ADATE, for automatic functional programming. ADATE uses speci cations that contain few constraints on the programs to be synthesized and that allow a wide range of correct programs. ADATE can generate novel and unexpected recursive programs with automatic invention of recursive auxiliary functions. Successively better programs are developed using incremental program...

متن کامل

Transparent Parallelization of Constraint Programming

The availability of commodity multi-core and multi-processor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. They also present a fundamental challenge: how to exploit parallelism transparently to speed up constraint programs. This paper shows how to parallelize constraint programs transparently without changes to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2006

ISSN: 0916-8532,1745-1361

DOI: 10.1093/ietisy/e89-d.2.390